A genetic algorithm-based approach to the set covering problem.
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملA Genetic Algorithm Approach for Set Covering Problems
In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several in...
متن کاملA GRASP algorithm to solve the unicost set covering problem
The set covering problem (SCP) is a wellknown combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the heuristics to solve satisfiability probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/24/2/1237